Practical guide to real options in discrete time

نویسندگان

  • Svetlana Boyarchenko
  • Sergei Levendorskǐi
چکیده

Continuous time models in the theory of real options give explicit formulas for optimal exercise strategies when options are simple and the price of an underlying asset follows a geometric Brownian motion. This paper suggests a general, computationally simple approach to real options in discrete time. Explicit formulas are derived even for embedded options. Discrete time processes reflect the scarcity of observations in the data, and may account for fat tails and skewness of probability distributions of commodity prices. The method of the paper is based on the use of the expected present value operators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing optimal subsidies for Iranian renewable energy investments using real options

For the valuation of the renewable energy investments, providing private investors with a financial incentive to accelerate their investment is a very significant issue. Financial subsidies are known by the majority of the people to be one of the most important drivers in renewable energy expansion and one of the main reasons which result in the development of any industry. In this paper, we pr...

متن کامل

A Direct Interaction Approach to Identify Real Options “In” Large-Scale Infrastructure Systems

There is a universe of real options opportunities for infrastructure development that are not fully considered in real options analysis literature. These are known as real options “in” infrastructures systems. They are design components embedded early on “in” the system design process – i.e. prior to fielding and operations – to enable time-to-build, scale alteration, product switching, and man...

متن کامل

A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

متن کامل

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004